Optical solution for bounded NP-complete problems
نویسندگان
چکیده
منابع مشابه
Optical solution for bounded NP-complete problems.
We present a new optical method for solving bounded (input-length-restricted) NP-complete combinatorial problems. We have chosen to demonstrate the method with an NP-complete problem called the traveling salesman problem (TSP). The power of optics in this method is realized by using a fast matrix-vector multiplication between a binary matrix, representing all feasible TSP tours, and a gray-scal...
متن کاملThe Traveling Beams Optical Solutions for Bounded NP-Complete Problems
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that simultaneously examine the different possible paths. The other approach uses a preprocessing stage in which O(n) masks are constructed, each representing a different edge in the graph. The choice and combination of the...
متن کاملComplete Problems for Monotone NP
We show that the problem of deciding whether a digraph has a Hamiltonian path between two specified vertices and the problem of deciding whether a given graph has a cubic subgraph are complete for monotone NP via monotone projection translations. We also show that the problem of deciding whether a uniquely partially orderable (resp. comparability) graph has a cubic subgraph is complete for NP v...
متن کاملBounded Second-Order Unification Is NP-Complete
Bounded Second-Order Unification is the problem of deciding, for a given second-order equation t ? = u and a positive integer m, whether there exists a unifier σ such that, for every second-order variable F , the terms instantiated for F have at most m occurrences of every bound variable. It is already known that Bounded Second-Order Unification is decidable and NP-hard, whereas general Second-...
متن کاملNeural Networks for Np-complete Problems
combinatorial optimization is an active field of research in Neural Networks. Since the first attempts to solve the travelling salesman problem with Hopfield nets several progresses have been made. I will present some Neural Network approximate solutions for NP-complete problems that have a sound mathematical foundation and that, beside their theoretical interest, are also numerically encouragi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Optics
سال: 2007
ISSN: 0003-6935,1539-4522
DOI: 10.1364/ao.46.000711